Comparison of rate-based service disciplines
نویسندگان
چکیده
منابع مشابه
Rate-Controlled Service Disciplines
We propose a class of non-work-conserving service disciplines, called the Rate-Controlled Service Disciplines. When coupled with suitable admission control algorithms, Rate-Controlled Service Disciplines can provide end-to-end deterministic and statistical performance guarantees on a per-connection basis in an arbitrary topology packet-switching network. The key feature of a rate-controlled ser...
متن کاملIn Proceedings of ACM SIGCOMM ' 91 Comparison of Rate - Based Service Disciplines
This paper compares six new queue service disciplines that can be implemented at the output queues of switches in a connection-oriented packet switched data network.cal Round Robin. We describe their mechanisms, their similarities and diierences, and some implementation strategies. In particular, we show why each discipline can or cannot provide bandwidth, delay and delay jitter guarantees. Thi...
متن کاملIn Proceedings of ACM SIGCOMM Comparison of Rate Based Service Disciplines
This paper compares six new queue service disciplines that can be implemented at the output queues of switches in a connection oriented packet switched data network These are Virtual Clock Fair Queueing Delay Earliest Due Date Jitter Earliest Due Date Stop and Go and Hierarchi cal Round Robin We describe their mechanisms their sim ilarities and di erences and some implementation strate gies In ...
متن کاملConvex comparison of service disciplines in real time queues
In this paper we present a comparison of the service disciplines in real-time queueing systems (the customers have a deadline before which they should enter the service booth). We state that the more a service discipline gives priority to customers having an early deadline, the least the average stationary lateness is. We show this result by comparing adequate random vectors with the Schur-Conv...
متن کاملService Guarantees for the LBR Class of Service Disciplines
We define a class of rate-based service disciplines called Lower-Bounded Rate (LBR) that provides upper bounds on end-to-end delay, end-to-end delay probability distribution, per-server buffer space requirements, and the probability distribution of per-server buffer space. This class includes VirtualClock, PGPS, and Leave-in-Time. We prove these upper bounds, and we also prove that for an impor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGCOMM Computer Communication Review
سال: 1991
ISSN: 0146-4833
DOI: 10.1145/115994.116004